On the Finiteness of Near Polygons with 3 Points on Every Line
نویسنده
چکیده
Let S be a near polygon of order (s, t) with quads through every two points at distance 2. The near polygon S is called semifinite if exactly one of s and t is finite. We show that S cannot be semifinite if s = 2 and derive upper bounds for t .
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملAnalysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model
Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملOn Q-polynomial regular near 2d-gons
We discuss thick regular near 2d-gons with a Q-polynomial collinearity graph. For d ≥ 4, we show that apart from Hamming near polygons and dual polar spaces there are no thick Q-polynomial regular near polygons. We also show that no regular near hexagons exist with parameters (s, t2, t) equal to (3, 1, 34), (8, 4, 740), (92, 64, 1314560), (95, 19, 1027064) or (105, 147, 2763012). Such regular n...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کامل